Monograph of the Okapi

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Okapi+QuEst: Translation Quality Estimation within Okapi

Due to the ever growing applicability of machine translation, estimating the quality of translations automatically has become a necessary task in various scenarios, for example, when deciding whether a machine translation is good enough for human post-editing. This demonstration presents the outcome of a collaborative project between the University of Sheffield and ENLASO, funded by EAMT, the E...

متن کامل

Okapi at TREC-2

This paper reports on City University's work on the TREC{2 project from its commencement up to November 1993. It includes many results which were obtained after the August 1993 deadline for submission of o cial results. For TREC{2, as for TREC{1, City University used versions of the Okapi text retrieval system much as described in [2] (see also [3, 4]). Okapi is a simple and robust set-oriented...

متن کامل

Okapi at TREC-4

The BSS, which has been used in all City's TREC experiments, is a set-oriented ranked output system designed primarily for probabilistic{type retrieval of textual material using inverted indexes. There is a family of built-in weighting functions as described in [1, Section 3]. In addition to weighting and ranking facilities it has the usual boolean and quasi-boolean (positional) operations. The...

متن کامل

Okapi-based XML indexing

Purpose – Being an important data exchange and information storage standard, XML has generated a great deal of interest and particular attention has been paid to the issue of XML indexing. Clear use cases for structured search in XML have been established. However, most of the research in the area is either based on relational database systems or specialized semi-structured data management syst...

متن کامل

Okapi at TREC-3

During the course of TREC{1 the low-level search functions were split o into a separate Basic Search System (BSS) [2], but retrieval and ranking of documents was still done using the \classical" probabilistic model of Robertson and Sparck Jones[7] with no account taken of document length or term frequency within document or query. Four runs were submitted to NIST for evaluation: automatic ad ho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science

سال: 1911

ISSN: 0036-8075,1095-9203

DOI: 10.1126/science.33.837.65-a